Grouping Heuristics for Word-Level Decision Diagrams

نویسندگان

  • Rolf Drechsler
  • Marc Herbstritt
  • Bernd Becker
چکیده

Word-Level Decision Diagrams (WLDDs), like EVBDDs, *BMDs, HDDs, K*BMDs, are powerful tools in circuit veriication. Especially for some arithmetic circuits, like multipliers, for the rst time formal veriication was possible using WLDDs. Beside a good variable ordering and the decomposition types the size of a WLDD essentially depends on the grouping of the outputs. In this paper we study output grouping in more detail. We give examples showing that an exponential reduction or an exponential blow-up can be obtained dependent on grouping. We describe eecient heuristics for output grouping given a circuit description in the form of a netlist. Experimental results are given to demonstrate the eeciency of our approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Word - Level Decision Diagrams , WLCDs

Several types of Decision Diagrams (DDs) have been proposed for the veriication of Integrated Circuits. Recently, word-level DDs like bmds, *bmds, hdds, k*bmds and *phdds have been attracting more and more interest, e.g., by using *bmds and *phdds it was for the rst time possible to formally verify integer multipliers and oating point multipliers of \signiicant" bitlengths, respectively. On the...

متن کامل

Prosodic Word Grouping in Mandarin TTS System

This paper reports the methodology and results of prosodic word grouping for a Mandarin TTS system developed by the Fujitsu Laboratories. In view of any inner prosodic word break will make speech unintelligible or unnatural, a new prosodic word grouping framework is proposed. The word segmentation result can be regarded as an initial prosodic word sequence with grids inserted into each word bou...

متن کامل

Data Clustering Using Grouping Hyper-heuristics

Grouping problems represent a class of computationally hard to solve problems requiring optimal partitioning of a given set of items with respect to multiple criteria varying dependent on the domain. A recent work proposed a general-purpose selection hyper-heuristic search framework with reusable components, designed for rapid development of grouping hyper-heuristics to solve grouping problems....

متن کامل

Numeric Function Generators Using Decision Diagrams for Discrete Functions

This paper introduces design methods for numeric function generators (NFGs) using decision diagrams. NFGs are hardware accelerators to compute values of numeric functions such as trigonometric, logarithmic, square root, and reciprocal functions. Most existing design methods for NFGs are intended only for a specific class of numeric functions. However, by using decision diagrams for discrete fun...

متن کامل

On Variable Ordering and Decomposition Type Choice in OKFDDs

| We present methods for the construction of small Ordered Kronecker Functional Decision Diagrams (OKFDDs). OKFDDs are a generalization of Ordered Binary Decision Diagrams (OBDDs) and Ordered Functional Decision Diagrams (OFDDs) as well. Starting with an upper bound for the size of an OKFDD representing a tree-like circuit we develope diierent heuristics to nd good variable orderings and decomp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999